On graphs with isomorphic, non-isomorphic and connected $N_2$-neighbourhoods
نویسندگان
چکیده
منابع مشابه
Non-Isomorphic Graphs with Cospectral Symmetric Powers
The symmetric m-th power of a graph is the graph whose vertices are m-subsets of vertices and in which two m-subsets are adjacent if and only if their symmetric difference is an edge of the original graph. It was conjectured that there exists a fixed m such that any two graphs are isomorphic if and only if their m-th symmetric powers are cospectral. In this paper we show that given a positive i...
متن کاملNon-Isomorphic Smallest Maximally Non-Hamiltonian Graphs
A graph G is maximally non-hamiltonian (MNH) if G is not hamiltonian but becomes hamiltonian after adding an arbitrary new edge. Bondy 2] showed that the smallest size (= number of edges) in a MNH graph of order n is at least d 3n 2 e for n 7. The fact that equality may hold there for innnitely many n was suggested by Bollobbs 1]. This was connrmed by Clark, Entringer and Shapiro (see 5, 6]) an...
متن کاملNonexistence of Triples of Nonisomorphic Connected Graphs with Isomorphic Connected P3-graphs
In the paper “Broersma and Hoede, Path graphs, J. Graph Theory 13 (1989) 427-444”, the authors asked a problem whether there is a triple of mutually nonisomorphic connected graphs which have an isomorphic connected P3-graph. In this paper, we show that there is no such triple, and thus completely solve this problem.
متن کاملNon-isomorphic C∗-algebras with Isomorphic Unitary Groups
Dye, [Ann. of Math. (2) 61 (1955), 73–89] proved that the discrete unitary group in a factor determines the algebraic type of the factor. Afterwards, for a large class of simple unital C∗-algebras, Al-Rawashdeh, Booth and Giordano [J. Funct. Anal. 262 (2012), 4711–4730] proved that the algebras are ∗-isomorphic if and only if their unitary groups are isomorphic as abstract groups. In this paper...
متن کاملSearching isomorphic graphs
To determine that two given undirected graphs are isomorphic, we construct for them auxiliary graphs, using the breadth-first search. This makes capability to position vertices in each digraph with respect to each other. If the given graphs are isomorphic, in each of them we can find such positionally equivalent auxiliary digraphs that have the same mutual positioning of vertices. Obviously, if...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Časopis pro pěstování matematiky
سال: 1987
ISSN: 0528-2195
DOI: 10.21136/cpm.1987.118295